#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

int uniquePaths(int m, int n);

int main()
{
	return 0;
}

int uniquePaths(int m, int n)
{
	int* dp = calloc(n, sizeof(int));
	for (int row = 0; row < m; row++) {
		dp[0] = 1;
		for (int col = 1; col < n; col++)
			dp[col] += dp[col - 1];
	}

	int res = dp[n - 1]; free(dp);
	return res;
}
